Constraint-Logic Object-Oriented Programming with Free Arrays
نویسندگان
چکیده
Constraint-logic object-oriented programming provides a useful symbiosis between and constraint-logic search. The ability to use logic variables, constraints, non-deterministic search, in an integrated way facilitates the combination of search-related program parts other business applications. With this work we add array-typed variables (“free arrays”), thus completing set types that can assume programming. Free arrays exhibit interesting properties, such as indeterminate lengths accesses array elements.
منابع مشابه
Object - Oriented Concurrent Constraint Programming
1.1 Abstract Oz is a higher-order concurrent constraint programming system under development at DFKI. It combines ideas from logic and concurrent programming in a simple yet expressive language. From logic programming Oz inherits logic variables and logic data structures, which provide for a programming style where partial information about the values of variables is imposed concurrently and in...
متن کاملDistributed object oriented logic programming
In this paper we introduce a programming language/system DK Parlog ++ which is an experimental testbed for distributed applications, particularly distributed AI and distributed knowledge base applications. The language is designed to have the concurrent computation ability of the Concurrent Logic Programming(CLP) languages, the knowledge representation and problem solving ability of Prolog, bot...
متن کاملObject-Oriented Concurrent Constraint Programming in Oz
1.1 Abstract Oz is a higher-order concurrent constraint programming system under development at DFKI. It combines ideas from logic and concurrent programming in a simple yet expressive language. From logic programming Oz inherits logic variables and logic data structures, which provide for a programming style where partial information about the values of variables is imposed concurrently and in...
متن کاملObject-Oriented Knowledge Bases in Logic Programming
characterization of the problem Naturally existential rules If you write a rule describing an object structure and create the following graph Each variable in the body of the rule is a node Each predicate in the body of the rule is a labeled edge between the variables participating in the predicate The resulting graph is not tree-structured Objects are so intricate that it is not po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-75333-7_8